#include<stdio.h>
#include<malloc.h>
 long long* Fibonacci(size_t N)
{
	long long* fibArray = malloc(sizeof(long long) * (N+1));
	fibArray[0] = 0;
	if (N == 0)
		return fibArray;
	fibArray[1] = 1;
	for (int i = 2; i <= N; i++)
	{
		fibArray[i] = fibArray[i - 1] + fibArray[i - 2];
	}
	//free(fibArray);
	return fibArray;
}
/*long long Fibonacci(size_t N)
{
	return N < 2 ? N : Fibonacci(N-1) + Fibonacci(N-2);
}*/
int main()
{
	printf("%d\n",Fibonacci(0));
	return 0;
}